Fault Tolerant Faddeeva Algorithm 1
نویسندگان
چکیده
We present an algorithm based fault tolerant scheme suitable for array implementations of the Faddeeva algorithm. Our technique corrects errors due to multiple transient, intermittent, or permanent faults provided these are restricted to a single column of the array. We show how to nd the location of the faulty column and to determine the correct Schur complement from the erroneous one. The fault recovery algorithm is of quadratic complexity in the number of rows of the input matrix while the hardware overhead is approximately 4 times the number of rows.
منابع مشابه
Modification of the Weighted Checksum Method for Deriving Fault Tolerant Versions of the Main Linear Algebra Algorithms
The modified weighted checksum method is proposed, which can be used for deriving fault tolerant versions of most linear algebra algorithms. The purpose is the detection and correction of calculation errors occurred due to transient hardware faults during algorithm execution. Using the proposed method, the fault-tolerant versions of Jordan-Gauss and Faddeeva algorithms are designed. The computa...
متن کاملAlgorithm-Based Fault Tolerance in Linear Algebra Tasks
The modification of weighted checksum method is proposed, which allows to derive the fault tolerant versions of most linear algebra algorithms. The purpose is detection and correction of calculation errors occurred due to transient hardware faults. Using the proposed method, the fault-tolerant version of Faddeeva algorithm is designed in this paper. The computational complexity of new algorithm...
متن کاملModification of the Weighted Checksum Method Modification of the Weighted Checksum Method for Deriving Fault Tolerant Versions of the Main Linear Algebra Algorithms
The modified weighted checksum method is proposed, which can be used for deriving fault tolerant versions of most linear algebra algorithms. The purpose is the detection and correction of calculation errors occurred due to transient hardware faults during algorithm execution. Using the proposed method, the faulttolerant versions of Jordan-Gauss and Faddeeva algorithms are designed. The computat...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007